Cardinality constrained Boolean quadratic polytope
نویسندگان
چکیده
منابع مشابه
On the cardinality constrained matroid polytope
Given a combinatorial optimization problem Π and an increasing finite sequence c of natural numbers, we obtain a cardinality constrained version Πc of Π by permitting only those feasible solutions of Π whose cardinalities are members of c. We are interested in polyhedra associated with those problems, in particular in inequalities that cut off solutions of forbidden cardinality. Maurras [11] an...
متن کاملAlgorithm for cardinality-constrained quadratic optimization
This paper describes an algorithm for cardinality-constrained quadratic optimization problems, which are convex quadratic programming problems with a limit on the number of non-zeros in the optimal solution. In particular, we consider problems of subset selection in regression and portfolio selection in asset management and propose branch-and-bound based algorithms that take advantage of the sp...
متن کاملOn the Solution of Nonconvex Cardinality Boolean Quadratic Programming problems
This paper addresses the solution of a nonlinear boolean quadratic programming problem using three different approaches. The first uses a classic linearization technique to transform the original problem into a Mixed Integer Linear Programming (MILP) problem for which multiple formulations are studied. The second uses the capabilities of current MILP solvers to deal with Mixed Integer Quadratic...
متن کاملA polynomial case of the cardinality-constrained quadratic optimization problem
We investigate in this paper a fixed parameter polynomial algorithm for the cardinality constrained quadratic optimization problem, which is NP-hard in general. More specifically, we prove that, given a problem of size n, the number of decision variables, and s, the cardinality, if, for some 0 < k ≤ n, the n − k largest eigenvalues of the coefficient matrix of the problem are identical, we can ...
متن کاملDouglas-Rachford Splitting for Cardinality Constrained Quadratic Programming
In this report, we study the class of Cardinality Constrained Quadratic Programs (CCQP), problems with (not necessarily convex) quadratic objective and cardinality constraints. Many practical problems of importance can be formulated as CCQPs. Examples include sparse principal component analysis [1], [2], cardinality constrained mean-variance portfolio selection problem [3]–[5], subset selection...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)00039-5